Connection Dispatching – an Algorithmic and Visual Support for the Dispatcher

Securing connections in public transport is a mean to raise travellers' satisfaction and make their trips more convenient. Nevertheless, securing connections affects the trips of other travellers and therefore is not always the best solution regarding the complex train network. Thus, dispatching connecting trains is a complex task that demands special knowledge about the railway network, travellers, local situations and conditions, the schedule, rolling stock circulations, employees' duty rosters and rules concerning the dispatching process. Furthermore, the topic becomes more relevant recently as the traffic on European railway networks grows more complex whilst the demand for a proper connection dispatching on the part of travellers as well as the authorities rises. To further improve this complex task, a decision support for the dispatcher is desirable. We focus on methods to (visually) support the dispatcher in his daily work. A mean to achieve a better connection dispatching is the detection and display of conflicts. Detected conflicts are evaluated and prioritized. With the results of these processes, the connection conflicts are displayed in a proper and easy-to-catch way. Furthermore, we are investigating ways to automate conflict resolution routine processes. Here, many side conditions regarding the German railway's system of rules have to be taken into account. Also, we consider the whole dispatching process including the rejection of a connection and referencing to alternative possibilities for a connection request. The developed solution is tested in the Railway Operations Centre Darmstadt. Possible improvements are verified in cooperation with the (connection) dispatcher to assure an acceptance of the developed tools by the future user. The results of our research are designed such that algorithms can be directly implemented in the productive system of the German railway dispatching environment.